Communicating across parallel message-passing environments
نویسندگان
چکیده
We present a small, extensible interface for the transparent communication between vendor speci c and standard message-passing environments. With only four new commands, existing parallel applications can make use of our PLUS communication interface, thereby allowing inter-process communication with other programming environments. Much e ort has been spent in optimizing the communication speed across Internet and Intranet links. Our current implementation supports process communication between PVM, MPI, and PARIX. With only marginal additional effort, the interface can be adapted to support other message passing environments as well.
منابع مشابه
A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملBuilding MPI for Multi-Programming Systems Using Implicit Information
With the growing importance of fast system area networks in the parallel community, it is becoming common for message passing programs to run in multi-programming environments. Competing sequential and parallel jobs can distort the global coordination of communicating processes. In this paper, we describe our implementation of MPI using implicit information for global coscheduling. Our results ...
متن کاملAn Application of CoSMoS Design Methods to Pedestrian Simulation
In this paper, we discuss the implementation of a simple pedestrian simulation that uses a multi agent based design pattern developed by the CoSMoS research group. Given the nature of Multi Agent Systems (MAS), parallel processing techniques are inevitably used in their implementation. Most of these approaches rely on conventional parallel programming techniques, such as threads, Message Passin...
متن کاملDerivation of Scalable Message-Passing Algorithms Using Parallel Combinatorial List Generator Functions
We present the transformational derivations of several efficient, scalable, message-passing parallel algorithms from clear functional specifications. The starting algorithms rely on some commonly used combinatorial list generator functions such as tails, inits, splits and cp (Cartesian product) for generating useful intermediate results. This paper provides generic parallel algorithms for effic...
متن کاملVolker Strumpen Latency - driven Programming of Computer Networks
Two properties of computer networks impose major constraints on distributed parallel programming: communication latencies, and permanently changing loads. We propose a technique that faces these problems by combining asynchronous message passing for latency hiding and message continuations for message-driven scheduling of threads. The key to these mechanisms is a portable multithreaded runtime ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Systems Architecture
دوره 44 شماره
صفحات -
تاریخ انتشار 1998